An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers
نویسندگان
چکیده
A Boolean function f :F2 → F2 is called an affine disperser of dimension d, if f is not constant on any affine subspace of F2 of dimension at least d. Recently Ben-Sasson and Kopparty gave an explicit construction of an affine disperser for sublinear d. The main motivation for studying such functions comes from extracting randomness from structured sources of imperfect randomness. In this paper, we show another application: we give a very simple proof of a 3n−o(n) lower bound on the circuit complexity (over the full binary basis) of affine dispersers for sublinear dimension. The same lower bound 3n−o(n) (but for a completely different function) was given by Blum in 1984 and is still the best known. The main technique is to substitute variables by linear functions. This way the function is restricted to an affine subspace of F2 . An affine disperser for sublinear dimension then guarantees that one can make n − o(n) such substitutions before the function degenerates. It remains to show that each such substitution eliminates at least 3 gates from a circuit.
منابع مشابه
Reviewing bounds on the circuit size of the hardest functions
In this paper we review the known bounds for L(n), the circuit size complexity of the hardest Boolean function on n input bits. The best known bounds appear to be 2 n (1 + log n n −O( 1 n )) ≤ L(n) ≤ 2 n n (1 + 3 log n n + O( 1 n )) However, the bounds do not seem to be explicitly stated in the literature. We give a simple direct elementary proof of the lower bound valid for the full binary bas...
متن کاملCGG90] L. Colussi, Z. Galil, R. Giancarlo. On the Exact Complexity of String Matching. Pro- ceedings of the Thirty First Annual IEEE Symposium on the Foundations of Computer Science, 1990, 135-143.
The problem of nding all occurrences of a pattern of length m in a text of length n is considered. It is shown that the Boyer-Moore string matching algorithm performs roughly 3n comparisons and that this bound is tight up to O(n=m); more precisely, an upper bound of 3n n m comparisons is shown, as is a lower bound of 3n(1 o(1)) comparisons, as n m !1 and m!1. While the upper bound is somewhat i...
متن کاملComputing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications Preliminary Version
Elementary symmetric polynomials S n are used as a benchmark for the boundeddepth arithmetic circuit model of computation. In this work we prove that S n modulo composite numbers m = p1p2 can be computed with much fewer multiplications than over any eld, if the coe cients of monomials xi1xi2 xik are allowed to be 1 either mod p1 or mod p2 but not necessarily both. More exactly, we prove that fo...
متن کاملAn Explicit Lower Bound of 5n - o(n) for Boolean Circuits
We prove a lower bound of 5n − o(n) for the circuit complexity of an explicit (constructible in deterministic polynomial time) Boolean function , over the basis U2. That is, we obtain a lower bound of 5n−o(n) for the number of {and, or} gates needed to compute a certain Boolean function, over the basis {and, or, not} (where the not gates are not counted). Our proof is based on a new combinatori...
متن کاملComputing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications
Elementary symmetric polynomials S n are used as a benchmark for the boundeddepth arithmetic circuit model of computation. In this work we prove that S n modulo composite numbersm = p1p2 can be computed with much fewer multiplications than over any field, if the coefficients of monomials xi1xi2 · · ·xik are allowed to be 1 either mod p1 or mod p2 but not necessarily both. More exactly, we prove...
متن کامل